Efficient Pairing Computation on Curves
نویسندگان
چکیده
In this paper, a method for the efficient computation of Tate pairings on curves which is a generalization of Barreto, etc.’s method [2] is presented. It can reduce the number of loops in the computation of the Tate pairing. The method can be applied not only to supersingular curves but to non-supersingular curves. An example shows the cost of the algorithm in this paper can be reduced by 18% or 13% than the best known algorithm in some elliptic curves.
منابع مشابه
Speeding Up Ate Pairing Computation in Affine Coordinates
At Pairing 2010, Lauter et al’s analysis showed that Ate pairing computation in affine coordinates may be much faster than projective coordinates at high security levels. In this paper, we further investigate techniques to speed up Ate pairing computation in affine coordinates. On the one hand, we improve Ate pairing computation over elliptic curves admitting an even twist by describing an 4-ar...
متن کاملA study of pairing computation for curves with embedding
This paper presents the first study of pairing computation on curves with embedding degree 15. We compute the Ate and the twisted Ate pairing for a family of curves with parameter ρ 1.5 and embedding degree 15. We use a twist of degree 3 to perform most of the operations in Fp or Fp5 . Furthermore, we present a new arithmetic for extension fields of degree 5. Our computations show that these cu...
متن کاملEfficient Pairing Computation on Genus 2 Curves in Projective Coordinates
In recent years there has been much interest in the development and the fast computation of bilinear pairings due to their practical and myriad applications in cryptography. Well known efficient examples are the Weil and Tate pairings and their variants such as the Eta and Ate pairings on the Jacobians of (hyper-)elliptic curves. In this paper, we consider the use of projective coordinates for ...
متن کاملTate pairing computation on the divisors of hyperelliptic curves for cryptosystems
In recent papers [4], [9] they worked on hyperelliptic curves Hb defined by y +y = x+x+b over a finite field F2n with b = 0 or 1 for a secure and efficient pairing-based cryptosystems. We find a completely general method for computing the Tate-pairings over divisor class groups of the curves Hb in a very explicit way. In fact, Tate-pairing is defined over the entire divisor class group of a cur...
متن کاملEfficient computation of pairings on Jacobi quartic elliptic curves
This paper proposes the computation of the Tate pairing, Ate pairing and its variations on the special Jacobi quartic elliptic curve Y 2 D dX C Z. We improve the doubling and addition steps in Miller’s algorithm to compute the Tate pairing. We use the birational equivalence between Jacobi quartic curves and Weierstrass curves, together with a specific point representation to obtain the best res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2007 شماره
صفحات -
تاریخ انتشار 2007